balanced tree
英 [ˈbælənst triː]
美 [ˈbælənst triː]
均衡树
双语例句
- Application of Balanced Binary Tree in Exhaustive Detector Generation Algorithm
平衡二叉树在穷举检测器生成算法中的应用 - The highly balanced binary search tree is established in order to improve efficiency of the binary search tree and to shorten the average search tree.
建立高度平衡的二叉搜索树是为了提高二叉搜索树的效率，减少树的平均搜索长度。 - Dynamic Load Balanced Tree Routing Algorithm for Wireless Sensor Networks
无线传感器网络动态负载均衡树路由算法 - Minimal Balanced Degree Spanning Tree with edge set Restricted Problem
带有边集限制的最均匀支撑树问题 - A predicted hierarchical decomposition method based on prior queue is proposed to implement the middle value method in order to build up a balanced tree, which can provide technical assurance for realtime collision detection.
提出一种基于优先队列的预测层次划分方法，通过建立的平衡树，快速实现中值划分，为实时的碰撞检测提供技术保证。 - Details of balanced trifurcate tree algorithm are presented. Test result proves the performance of this algorithm is good and stable.
分析和详细说明了平衡三叉树的算法，通过测试数据证明平衡三叉树算法的性能是稳定和良好的。 - Application of the Balanced 2-branch Tree of Discrete Points of Elevation in Establishing a Digital Elevation Model
高程离散点的平衡二叉树在建立地形数字模型中的应用 - Research of Merging Algorithm of Implement based on Balanced Trifurcate Tree
基于平衡三叉树实现归并算法的研究 - At last we solve the minimal balanced degree spanning tree with edge set restricted problem based on the two solved problems.
最后，在已解决的两个问题的基础上解决了带有边集限制的最均匀支撑树问题。 - In this paper, we describe some general techniques in the design of parallel algorithms, balanced binary tree method, the doubling technique, the divide-and-conquer technique, compress-on technique and the Euler's tour technique.
本文讨论并行算法设计中的几种常用展术：平衡二叉树法、倍增法、分治技术、压缩技术和欧拉遍历技术。 - In this paper, we construct the network model of the minimal balanced degree spanning tree with edge set restricted problem in the undirected network.
本文在无向网络中，建立了带有边集限制的最均匀支撑树问题的网络模型。 - Active search circle algorithm of isoline model based on balanced binary tree
基于平衡二叉树的动态搜索圆等值线模型算法 - Later we explore the newly algorithms of temporal aggregation, which are aggregation tree algorithm, k-ordered aggregation tree algorithm, 2-3 tree algorithm, balanced tree algorithm and merge-sort aggregation algorithm.
综述了聚集树算法、k级有序聚集树算法、2-3树算法、平衡树算法以及归并排序聚集算法等时态聚集算法。 - This text describe a new data structure named balanced trifurcate tree and how it is used in merging data collected by Net-flow protocol.
本文阐述了如何使用一种新的数据结构平衡三叉树来对Netflow数据采集协议采集到的数据进行归并。 - Furthermore, we get a comparative balanced index tree by improving the points in the root node.
通过对根节点中数据点选取进行优化，以得到相对平衡的索引树。 - Through providing a new way to compute the aggregation values of balanced tree algorithm, we make the balanced tree algorithm suit for the situation when the valid time periods of tuples are closed-closed timestamps.
通过改进平衡树算法的聚集值计算方法，使平衡树算法可以适用于元组的有效时间为闭区间的情形。 - R-tree, like B+ tree, is dynamic balanced tree, the search key is based on spatial object's minimum bounding rectangle.
R树是一种类似于B~+树的动态平衡树，其索引项基于空间对象的最小外接矩形。 - Balance Adjusting Algorithm of Balanced Binary Sort Tree
平衡二叉排序树的平衡调整简单算法 - A RB+ tree is almost a full and balanced binary tree, in which each node is able to accommodate more indexed entries, therefore, search paths are short.
RB+树几乎是一棵满的平衡二叉树，一页能容纳更多的索引项，因而能用较矮的RB+树存储大量的索引项。 - R-tree as a height balanced tree and multidimensional index structure, is very suitable for establishment of multidimensional indexes for file metadata. It can return the result of precomputation quickly to improve queries efficiency.
RCube采用R树来作为它的索引结构，它是一棵高度平衡的树，是一种多维的索引结构，非常适用于对文件元数据建立多维索引，能够快速的返回预计算结果，提高查询效率。 - The second method, which adopts an array of balanced tree, reduces the complexity further by decouple the sorting according to the distance from the one according to the degree.
其中基于平衡搜索树数组的方法，将基于到根节点距离的排序和基于连接度的排序解耦，进一步降低了计算复杂度。 - Secondly, we decompose the privacy leakage risk tree into a risk balanced tree and a set of risk paths.
其次将隐私泄漏风险树分解成一棵风险平衡树和一组风险路径。 - To avoid this from happening, we introduce the concept of "balanced tree".
为了避免这种情况的发生，人们引进了平衡树的概念。 - The situations of absolute balanced tree and linear tree are avoided in this model, and the bandwith occupation of operator network is saved.
该模型避免了系统直播树状结构趋于绝对平衡树或退化成线性树的情况，也节省了运营商网络的带宽占用。 - According to the model analysis built on the effect of nitrogen, phosphorus and potassium balanced application to tree height and ground diameter, only the F-test based on the model of ground diameter and nitrogen acts significantly. 2.
根据树高、地径与施肥量建立的氮磷钾肥效模型分析结果表明，仅地径氮元素单元肥效模型的F检验显著。 - Compared with the indicator based method, the balanced tree based methods trace the dynamic change of the check points 'layer structure during the tree extension of the Tanner graph.
与基于标志位的实现方法相比，基于平衡搜索树的方法在进行Tanner图树形展开过程中动态跟踪校验节点分层结构的变化。 - Because B+ tree is sorted balanced multi-branches tree, the routing structure in B+ tree really sets up tree-index routing on nodes in order to achieve the scope search.
B+树结构是一种有序的平衡的多叉树，可以通过B+树为P2P网络中的节点标识符建立树型索引，以实现范围查找。 - The result integration algorithm mainly processes result sets in respects of connection operation, group operation and nested query; connection operation sorts the result sets using the technology of preprocessing, group operation grounds on balanced tree, nested query utilizes hash mapping and iterator.
结果整合算法主要对结果集进行连接操作、分组操作及嵌套查询；连接操作使用预处理技术对结果集进行排序，分组操作基于平衡树进行，嵌套查询利用Hash映射和迭代器完成。